Automated evolutionary synthesis matching - Advanced evolutionary algorithms for difficult sound matching problems

نویسنده

  • Thomas Mitchell
چکیده

This paper discusses the subject of automatic evolutionary sound matching: systems in which evolutionary algorithms are used to automatically derive the parameters of a synthesiser to produce a sound that matches a specified target sound. The paper describes prior work and identifies the principal causes of match inaccuracy, which are often due to optimiser limitations as a result of search space problem difficulty. The components of evolutionary matching systems contributing to problem difficulty are discussed and suggestions as to how improvements can be made through problem simplification or optimiser sophistication are considered. Subsequently, a novel clustering evolution strategy is presented which enables the concurrent optimisation of multiple distinct search space solutions, intended for the purposes of sound matching with standard frequency modulation (FM) synthesisers. The algorithm is shown to outperform standard multi-membered and multi-start (1 ? 1) evolution strategies in application to different FM synthesis models for static and dynamic sounds. The comparative study makes use of a contrived matching method, which ensures that results are not affected by the limitations of the matching

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Cardinality Matching by Evolutionary Algorithms

The analysis of time complexity of evolutionary algorithms has always focused on some artificial binary problems. This paper considers the average time complexity of an evolutionary algorithm for maximum cardinality matching in a graph. It is shown that the evolutionary algorithm can produce matchings with nearly maximum cardinality in average polynomial time.

متن کامل

OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS

Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...

متن کامل

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

متن کامل

DRAFT - - DRAFT - - DRAFT - - DRAFT - - DRAFT - - 1 Time Complexity of Maximum Matching by an ( N + N ) Evolutionary Algorithm

An (N +N) evolutionary algorithm is considered for the problem of finding the maximum cardinality matching in a graph. It is shown that the performance of the evolutionary algorithm is the same as classical simulated annealing. That is, the evolutionary algorithm cannot find the maximum matching in polynomial average time for a family of bipartite graphs considered in this paper although there ...

متن کامل

Evolutionary Computation Applied to Sound Synthesis

Sound synthesis is a natural domain in which to apply evolutionary computation (EC). The EC concepts of the genome, the phenotype, and the fitness function map naturally to the synthesis concepts of control parameters, output sound, and comparison with a desired sound. More importantly, sound synthesis can be a very unintuitive technique, since changes in input parameters can give rise, via non...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Soft Comput.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2012